-
1 производить сложение по модулю 2
Makarov: form the modulo 2 sum ofУниверсальный русско-английский словарь > производить сложение по модулю 2
-
2 сложение
* * *сложе́ние с.1. мат. additionосуществля́ть [производи́ть] сложе́ние, напр. двух чи́сел — take the sum of, e. g., two numbersсложе́ние осуществля́ется [произво́дится] на основа́нии, напр. сочета́тельного зако́на — addition proceeds by use of, e. g., associative properties2. (сигналов, сил и т. п.) compositionсложе́ние вероя́тностей — composition of probabilitiesсложе́ние волн — wave interferenceсложе́ние вычита́нием — addition by subtractionгеометри́ческое сложе́ние — vectorial additionсложе́ние движе́ний — composition of motionsлоги́ческое сложе́ние — logical additionсложе́ние по мо́дулю N — modulo N additionпроизводи́ть сложе́ние по мо́дулю, напр. 2 — take the modulo, e. g., 2 sum of …, take the sum modulo, e. g., 2 of …, form the modulo, e. g., 2 sum of …сложе́ние сил — composition of forces -
3 сумма
amount, sum, total* * *су́мма ж.
sumбрать су́мму по всем це́лым значе́ниям (от … до …) — take the sum over all integers (from … to …)дава́ть в су́мме … — add up to …получа́ть су́мму, напр. трёх чи́сел — form the sum of, e. g., three numbersсоставля́ть в су́мме, напр. 12 — add up to, e. g., 12алгебраи́ческая су́мма — algebraic sumарифмети́ческая су́мма — arithmetic(al) sumсу́мма ве́кторов — vector sumгеометри́ческая су́мма — vector sumито́говая су́мма — (sum) totalобразова́ть ито́говую су́мму — develop a totalконтро́льная су́мма — check sum, check sumлоги́ческая су́мма — logical sumсу́мма невя́зок геод. — accumulated discrepancy, accumulated divergenceоконча́тельная су́мма — final sumсу́мма по мо́дулю — 2 modulo 2 sumчасти́чная су́мма — partial sum
См. также в других словарях:
Kummer sum — In mathematics, Kummer sum is the name given to certain cubic Gauss sums for a prime modulus p , with p congruent to 1 modulo 3. They are named after Ernst Kummer, who made a conjecture about the statistical properties of their arguments, as… … Wikipedia
Exponential sum — In mathematics, an exponential sum may be a finite Fourier series (i.e. a trigonometric polynomial), or other finite sum formed using the exponential function, usually expressed by means of the function:e(x) = exp(2pi ix).Therefore a typical… … Wikipedia
Gauss sum — In mathematics, a Gauss sum or Gaussian sum is a particular kind of finite sum of roots of unity, typically: G ( chi;, psi;) = Sigma; chi;( r ) psi;( r )where the sum is over elements r of some finite commutative ring R , psi;( r ) is a group… … Wikipedia
Primitive root modulo n — In modular arithmetic, a branch of number theory, a primitive root modulo n is any number g with the property that any number coprime to n is congruent to a power of g (mod n ). That is, if g is a primitive root (mod n ) and gcd( a , n ) = 1,… … Wikipedia
Kloosterman sum — In mathematics, a Kloosterman sum is a particular kind of exponential sum. Let a , b , m be natural numbers. Then :K(a,b;m)=sum {0leq xleq m 1, gcd(x,m)=1 } e^{2pi i (ax+bx^*)/m},Here x* is the inverse of x modulo m . They are named for the Dutch … Wikipedia
Multiplicative group of integers modulo n — In modular arithmetic the set of congruence classes relatively prime to the modulus n form a group under multiplication called the multiplicative group of integers modulo n. It is also called the group of primitive residue classes modulo n. In… … Wikipedia
Jacobi sum — In mathematics, a Jacobi sum is a type of character sum formed with one or more Dirichlet characters. The simplest example would be for a Dirichlet character χ modulo a prime number p . Then take: J (χ) = Σ χ( a )χ(1 − a ) where the summation… … Wikipedia
Quadratic reciprocity — The law of quadratic reciprocity is a theorem from modular arithmetic, a branch of number theory, which shows a remarkable relationship between the solvability of certain quadratic equations modulo different prime moduli.Although it allows us to… … Wikipedia
Luhn algorithm — The Luhn algorithm or Luhn formula, also known as the modulus 10 or mod 10 algorithm, is a simple checksum formula used to validate a variety of identification numbers, such as credit card numbers, IMEI numbers, National Provider Identifier… … Wikipedia
Bailey–Borwein–Plouffe formula — The Bailey–Borwein–Plouffe formula (BBP formula) provides a spigot algorithm for the computation of the n th binary digit of π. This summation formula was discovered in 1995 by Simon Plouffe. The formula is named after the authors of the paper in … Wikipedia
Quadratic sieve — The quadratic sieve algorithm (QS) is a modern integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is… … Wikipedia
